翻訳と辞書
Words near each other
・ Henning Ohlson
・ Henning Otte
・ Henning Palner
・ Henning Petersen
・ Henning Podebusk
・ Henning Rønne
・ Henning Rübsam
・ Henning Scheich
・ Henning Scherf
・ Henning Schindekop
・ Hennessy Gold Cup (Ireland)
・ Hennessy Islands
・ Hennessy Road
・ Hennessy Youngman
・ Hennessy's
Hennessy–Milner logic
・ Hennesy
・ Henneveux
・ Henney
・ Henney Kilowatt
・ Hennezel
・ Hennezis
・ Henni Forchhammer
・ Henni Zuël
・ Hennie Aucamp
・ Hennie Bekker
・ Hennie Bester
・ Hennie Binneman
・ Hennie Daniller
・ Hennie de Wet


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Hennessy–Milner logic : ウィキペディア英語版
Hennessy–Milner logic
In computer science, Hennessy–Milner logic (HML) is a dynamic logic used to specify properties of a labeled transition system, a structure similar to an automaton. It was introduced in 1980 by Matthew Hennessy and Robin Milner in their paper 'On observing nondeterminism and concurrency' (ICALP).
Another variant of the HML involves the use of recursion to extend the expressibility of the logic, and is commonly referred to as 'Hennessy-Milner Logic with recursion'. Recursion is enabled with the use of maximum and minimum fixed points.
==Syntax==

A formula is defined by the following BNF grammar for ''L'' some set of actions:
:\Phi ::= tt \,\,\, | \,\,\,ff\,\,\, | \,\,\,\Phi_1 \land \Phi_2 \,\,\, | \,\,\,\Phi_1 \lor \Phi_2\,\,\, | \,\,\,() \Phi\,\,\, | \,\,\, \langle L \rangle \Phi
That is, a formula can be
; constant truth tt: always true
; constant false ff: always false
; formula conjunction
; formula disjunction
; \scriptstyle formula : for all ''L''-derivatives, ''Φ'' must hold
; \scriptstyle formula : for some ''L''-derivative, ''Φ'' must hold

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Hennessy–Milner logic」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.